An Efficient Tasks Scheduling Model in Distributed Processing Systems Using ANN

نویسندگان

  • Pradeep Kumar Yadav
  • Avanish Kumar
  • Babita Agarwal
  • M. P. Singh
چکیده

The single communication channel is shared by all the processors for Inter-Processor Communication (IPC) in a distributed system. A program whose execution is distributed among several processors in a distributed system has the total processing cost equal to the sum of Execution Costs (EC) and Inter-Processor Communication, which are function of the amount of data transmitted. An optimal assignment is a distribution of tasks that has lowest total execution cost. The neural network architecture is used to form tasks clusters between maximally linked tasks and to restrict the clusters size, the average load to be assigned to each processor. The Artificial Neural Network (ANN) based model has been discussed in this paper. The model provides near to optimal solution for assigning a set of “m” tasks of a program to set of “n” processors where “m >> n” in such a way that allocated load on all processors is balanced according to the average load. For testing the efficiency of the algorithm, several sets of input data have been considered for all program Pradeep Kumar Yadav, M.P. Singh, Avanish Kumar and Babita Agarwal

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Efficient Genetic Algorithm for Task Scheduling on Heterogeneous Computing Systems Based on TRIZ

An efficient assignment and scheduling of tasks is one of the key elements in effective utilization of heterogeneous multiprocessor systems. The task scheduling problem has been proven to be NP-hard is the reason why we used meta-heuristic methods for finding a suboptimal schedule. In this paper we proposed a new approach using TRIZ (specially 40 inventive principles). The basic idea of thi...

متن کامل

An Efficient Genetic Algorithm for Task Scheduling on Heterogeneous Computing Systems Based on TRIZ

An efficient assignment and scheduling of tasks is one of the key elements in effective utilization of heterogeneous multiprocessor systems. The task scheduling problem has been proven to be NP-hard is the reason why we used meta-heuristic methods for finding a suboptimal schedule. In this paper we proposed a new approach using TRIZ (specially 40 inventive principles). The basic idea of thi...

متن کامل

Evaluation of scheduling solutions in parallel processing using DEA FDH model

This paper gives a new application of DEA to evaluate the scheduling solutions of parallel processing. It evaluates the scheduling solutions of parallel processing using the non-convex DEA model, FDH model. By introducing each solution of parallel processing scheduling as a DMU with some relevant inputs and outputs this paper shows that how the most efficient schedule(s) can be identified.

متن کامل

A new Shuffled Genetic-based Task Scheduling Algorithm in Heterogeneous Distributed Systems

Distributed systems such as Grid- and Cloud Computing provision web services to their users in all of the world. One of the most important concerns which service providers encounter is to handle total cost of ownership (TCO). The large part of TCO is related to power consumption due to inefficient resource management. Task scheduling module as a key component can has drastic impact on both user...

متن کامل

A Flexible Job Shop Scheduling Problem with Controllable Processing Times to Optimize Total Cost of Delay and Processing

In this paper, the flexible job shop scheduling problem with machine flexibility and controllable process times is studied. The main idea is that the processing times of operations may be controlled by consumptions of additional resources. The purpose of this paper to find the best trade-off between processing cost and delay cost in order to minimize the total costs. The proposed model, flexibl...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012